The 2-Machine Routing Open Shop on a Triangular Transportation Network
نویسندگان
چکیده
The two machine routing open shop being a generalization of the metric TSP and two machine open shop scheduling problem is considered. It is known to be NP-hard even for the simplest case when the transportation network consists of two nodes only. For that simplest case it is known that the optimal makespan for any instance belongs to interval [R̄, 6 5 R̄], there R̄ is the standard lower bound. We generalize that classic result to the case of three-nodes transportation network and present a linear time 6 5 -approximation algorithm for that case.
منابع مشابه
A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملDesigning Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملA model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach
Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...
متن کاملA ROUTING METHODOLOGY FOR HAZARDOUS MATERIALS TRANSPORTATION TO REDUCE THE RISK OF ROAD NETWORK
Abstract: The shipments of hazardous materials (HAZMATs) induce various risks to the road network. Today, one of the major considerations of transportation system managers is HAZMATs shipments, due to the increasing demand of these goods (because it is more used in industry, agriculture, medicine, etc.), and the rising number of incidents that are associated to hazardous materials. This paper ...
متن کامل